Expressive Flexibility of a Constraint-Oriented Notation

We illustrate the expressive #exibility of the `co-notation', a declarative, structured, constraintoriented speci"cation technique for concurrent systems where constraints on actions and on data variables are intertwined. Flexibility is intended here as the ability to closely match the structure of the initial, informal behavioural description of the system, and to directly formalize the conceptual links among data variables and events, and their groupings, as expressed in that description. We contrast the co-notation with two related and `mature' speci"cation techniques, namely predicate/transition Petri nets and LOTOS, also by means of a running example. The Petri net approach supports a quite direct speci"cation of the links among actions and data variables, but it lacks structuring facilities; LOTOS does support encapsulation, but its process-oriented view does not offer full #exibility in de"ning and composing groups of those conceptual links. We show that the simple yet powerful constraint conjunction operator of the co-notation, supporting both shared-action (rendez-vous) and shared-variable interaction mechanisms, achieves a higher expressive #exibility than the other models, and brings to a full exploitation the constraint-oriented reasoning partially offered by LOTOS.